On consistency of determinants on cubic lattices
نویسنده
چکیده
Consider the square lattice Z with vertices at points with integer-valued coordinates in R = {(x1, x2)| xk ∈ R, k = 1, 2} and complex (or real) scalar fields u on the lattice Z, u : Z → C, that are defined by their values ui1i2 , ui1i2 ∈ C, at each vertex of the lattice with the coordinates (i1, i2), ik ∈ Z, k = 1, 2. Consider a class of two-dimensional discrete equations on the lattice Z for the field u that are defined by functions Q(x1, x2, x3, x4) of four variables with the help of the relations
منابع مشابه
On initial data in the problem of consistency on cubic lattices for 3 x 3 determinants
The paper is devoted to complete proofs of theorems on consistency on cubic lattices for 3 × 3 determinants. The discrete nonlinear equations on Z defined by the condition that the determinants of all 3×3 matrices of values of the scalar field at the points of the lattice Z that form elementary 3 × 3 squares vanish are considered; some explicit concrete conditions of general position on initial...
متن کاملOn Initial Data in the Problem of Consistency on Cubic Lattices for $3 \times 3$ Determinants
The paper is devoted to complete proofs of theorems on consistency on cubic lattices for 3 × 3 determinants. The discrete nonlinear equations on Z defined by the condition that the determinants of all 3×3 matrices of values of the scalar field at the points of the lattice Z that form elementary 3 × 3 squares vanish are considered; some explicit concrete conditions of general position on initial...
متن کاملConsistency on cubic lattices for determinants of arbitrary orders
We consider a special class of two-dimensional discrete equations defined by relations on elementary N ×N squares, N > 2, of the square lattice Z, and propose a new type of consistency conditions on cubic lattices for such discrete equations that is connected to bending elementary N × N squares, N > 2, in the cubic lattice Z. For an arbitrary N we prove such consistency on cubic lattices for tw...
متن کاملOn the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices
We present a new expression for the partition function of the dimer arrangements and the Ising partition function of the 3-dimensional cubic lattice. We use the Pfaffian method. The partition functions are expressed by means of expectations of determinants and Pfaffians of matrices associated with the cubic lattice.
متن کاملInterpolation on lattices generated by cubic pencils
Principal lattices are distributions of points in the plane obtained from a triangle by drawing equidistant parallel lines to the sides and taking the intersection points as nodes. Interpolation on principal lattices leads to particularly simple formulae. These sets were generalized by Lee and Phillips considering three-pencil lattices, generated by three linear pencils. Inspired by the additio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0809.2032 شماره
صفحات -
تاریخ انتشار 2008